Natural Deduction System in Paraconsistent Setting: Proof Search for PCont
نویسندگان
چکیده
منابع مشابه
Natural Deduction System in Paraconsistent Setting: proof search for PCont
This paper continues a systematic approach to build natural deduction calculi and corresponding proof procedures for non-classical logics. Our attention is now paid to the framework of paraconsistent logics. These logics are used, in particular, for reasoning about systems where paradoxes do not lead to the ‘deductive explosion’, i.e., where formulae of the type ‘A follows from false’, for any ...
متن کاملNatural Deduction and the Isabelle Proof Assistant
Our motivation is that our students should obtain a logical background that give them the prerequisites to build and formally verify dependent software. Building and verifying such software systems can be done in proof assistant computer programs like Isabelle [16] in which natural deduction reasoning is a central concept. Our website therefore forms part of a course which, among other subjects...
متن کاملNovel Didactic Proof Assistant for First-Order Logic Natural Deduction
We present a proof assistant designed to help learning formal proof, particularly in the system of Natural Deduction for First-Order Logic. The assistant handles formulas and derivations containing metavariables and allows to maintain a library of instanciable lemmas. It possesses a graphical interface presenting proofs as trees and handles multiple simultaneous derivations that can be dragged ...
متن کاملProof Methods in an Agenda-Based Natural-Deduction Theorem Prover
This note describes several methods of finding proofs used in APRVR, an agenda-based, natural-deduction theorem prover. APRSR retains a complete tree of all pending or completed goals and is able to choose the next goal to be processed from an agenda of pending goals. Through this mechanism some proof methods can be utilized that had been unavailable to an earlier prover that was not agenda-bas...
متن کاملOn natural deduction system for nonmonotonic reasoning
This paper is concerned with the problem of how to construct a natural deduction system for nonmonotonic reasoning. Three possible constructions are investigated, the ones which consists of (1) pure nonmonotonic inference rules; (2) nonmonotonic inference rules plus a nonmonotonic tautology base; or (3) nonmonotonic inference rules plus a nonmonotonic conditional assertion base. Based on a fram...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Intelligent Systems
سال: 2012
ISSN: 0334-1860,2191-026X
DOI: 10.1515/jisys-2011-0021